A Heuristic Based On Makespan Lower Bounds in Flow Shops with Multiple Processors
نویسندگان
چکیده
منابع مشابه
A Heuristic Based On Makespan Lower Bounds in Flow Shops with Multiple Processors
Minimum makespan scheduling of Flow Shops with Multiple Processors (FSMPs), also known as the Hybrid Flow Shop (HFS), is classified as NP complete. Thus, the FSMP largely depends on strong heuristics to develop solutions to makespan scheduling instances. An FSMP consists of m stages wherein each stage has one or more processors through which n jobs are scheduled. This paper presents a heuristic...
متن کاملA Heuristic to Minimize Makespan in Proportional Parallel Flow Shops
This paper addresses the problem of minimizing the makespan on a two-stage parallel flow shops with proportional processing times. The problem of scheduling n independent jobs on m proportional parallel flow shops to minimize makespan is known to be NP-hard and hence too difficult to solve in polynomial time. A multiphase heuristic algorithm to minimize the makespan on two proportional parallel...
متن کاملA note on makespan minimization in proportionate flow shops
We consider two generalizations of the proportionate flow shop scheduling problem with the makespan objective. Each job has a processing requirement and each machine has a characteristic value. In our first (second) case we assume that the time a job occupies a machine is the maximum (minimum) of the processing requirement of the job and the characteristic value of the machine. We show that the...
متن کاملA Fluid Heuristic for Minimizing Makespan in Job Shops
We describe a simple online heuristic for scheduling job shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N , on each route. The heuristic uses safety stocks and keeps the bottleneck machine busy at almost all times, while the other machines are paced by the bottleneck machine. We perform a probabilistic analysis of the heuristic, under some assumptions on the di...
متن کاملDecomposition-based Makespan Minimization in Job Shops
This paper proposes a decomposition-based heuristic approach to minimizing the makespan of job shops. In general, decomposition methods first divide the whole problem into several sub-problems, solve them and then combine sub-schedules to obtain a good feasible schedule. Although it may be reasonable to minimize the makespan of each sub-problem, its optimality will be lost when combining sub-sc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Industrial and Systems Engineering Review
سال: 2017
ISSN: 2329-0188
DOI: 10.37266/iser.2017v5i1.pp33-43